Derandomizing Compressed Sensing With Combinatorial Design
نویسندگان
چکیده
منابع مشابه
On combinatorial approaches to compressed sensing
In this paper, we look at combinatorial algorithms for Compressed Sensing from a different perspective. We show that certain combinatorial solvers are in fact recursive implementations of convex relaxation methods for solving compressed sensing, under the assumption of sparsity for the projection matrix. We extend the notion of sparse binary projection matrices to sparse real-valued ones. We pr...
متن کاملDictionary Design for Compressed Sensing MRI
Introduction: The recently introduced Compressed Sensing (CS) theory promises to accelerate data acquisition in magnetic resonance imaging (MRI) [1-3]. One of the important requirements in CS MRI is that the image has a sparse representation. This sparse representation is crucial for successful recovery in CS. Generally speaking, sparser representations yield improved performance in terms of ei...
متن کاملCompression2: compressed sensing with compressed coil arrays
Background Imaging with large coil arrays is desirable for rapid imaging and high signal to noise ratio. Compressed sensing (CS) is a promising way to accelerate myocardial perfusion imaging [1]. However with increasing number of coils CS is costly in terms of memory and computation time. Coil compression methods for reconstructing cardiac cine data with parallel imaging have been proposed [2,3...
متن کامل"Compressed" compressed sensing
The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller number of samples is sufficient when there exists prior knowledge about the distribution of the unknown vector, or when only partial recovery is...
متن کاملFrames for compressed sensing using coherence
We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satised. Moreover, we give better estimations then the ones given recently by Cai, Wang and Xu.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Applied Mathematics and Statistics
سال: 2019
ISSN: 2297-4687
DOI: 10.3389/fams.2019.00026